A minimal communication approach to parallel time integration
نویسندگان
چکیده
منابع مشابه
A minimal communication approach to parallel time integration
We explore an approach due to Nievergelt of decomposing a time-evolution equation along the time dimension and solving it in parallel with as little communication as possible between the processors. This method computes a map from initial conditions to final conditions locally on slices of the time domain, and then patches these operators together into a global solution using a single communica...
متن کاملN Communication X an Approach to Parallel M 399 Parallel M × N Communication an Approach to Parallel M × N Communication
High performance scientific applications are frequently multiphysics codes composed from single-physics programs, or have a functional decomposition based on physics as well as a domain decomposition for parallelism. In either case, dividing the application into independent components that can be developed and tested separately is useful. This requires a fast and efficient mechanism to share th...
متن کاملA Parallel Approach to the Minimal Involutive Basis Algorithm
In the paper [2] the probabilistic algorithm to obtain the reduced Gröbner Basis of an algebraic ideal over the ring of integers was presented. This algorithm leaves a place for a possibility that the basis obtained is not valid Gröbner one (with certain, but very small probability). The idea behind is to perform computation of the reduced Gröbner Basis for the integer ideal I and for its proje...
متن کاملa 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter
applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...
15 صفحه اولOptimal Communication Interval for Parallel Adaptive Integration
Parallelization of integration routines based on adaptive subdivision strategies is inherently difficult. Hard subregions turning up on one node have to be redistributed to other nodes as fast as possible. Determining the optimal communication frequency is crucial, otherwise the program either wastes time with excessive communication, or only few nodes can tackle important regions. We simulate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2013
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2013.800193